Probability Constrained Search Range Determination for Fast Motion Estimation

نویسندگان

  • Hyun-Soo Kang
  • Hamid Gholam Hosseini
چکیده

© 2012 Hyun-Soo Kang et al. 369 In this paper, we propose new adaptive search range motion estimation methods where the search ranges are constrained by the probabilities of motion vector differences and a search point sampling technique is applied to the constrained search ranges. Our new methods are based on our previous work, in which the search ranges were analytically determined by the probabilities. Since the proposed adaptive search range motion estimation methods effectively restrict the search ranges instead of search point sampling patterns, they provide a very flexible and hardware-friendly approach in motion estimation. The proposed methods were evaluated and tested with JM16.2 of the H.264/AVC video coding standard. Experiment results exhibit that with negligible degradation in PSNR, the proposed methods considerably reduce the computational complexity in comparison with the conventional methods. In particular, the combined method provides performance similar to that of the hybrid unsymmetrical-cross multi-hexagon-grid search method and outstanding merits in hardware implementation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive search area for fast motion estimation

In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...

متن کامل

Fast rate-constrained N-step search algorithm for motion estimation

A fast N-step search algorithm for rate-constrained motion estimation is presented. The motion vectors are selected from a search window based on a rate-distortion criterion by successively eliminating the search positions at each step. The performance of the proposed algorithm is identical to the performance of the conventional rate-constrained N-step search algorithm, with considerable reduct...

متن کامل

Adaptive Search Range Determination for Fast Motion Estimation

The motion estimation (ME) in video codec is extremely important, having acritical effect on encoding time and video quality. Although the full search algorithm is the most fundamental ME method which shows the best video quality, it has high computation complexity. To alleviate this issue, many literatures have been proposed to improve the computational speed and maintain the video quality. In...

متن کامل

Fast long-term motion estimation for H.264 using multiresolution search

In this paper, we propose an adaptive motion search window location algorithm which incorporates multiresolution motion estimation information and the motion vector information predicted from neighboring encoded blocks. To reduce the computational complexity, we employ the spatial and temporal search range reduction that we proposed in [1]. Our proposed fast search is implemented and tested in ...

متن کامل

Fast Motion Estimation Techniques with Adaptive Variable Search Range

In this paper, we present two fast motion estimation techniques with adaptive variable search range using spatial and temporal correlation of moving pictures respectively. The first technique uses a frame difference between two adjacent frames which is used as a criterion for deciding search window size. The second one uses deviation between the past and the predicted current frame motion vecto...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012